Proof of Theorem cleqfv
| Step | Hyp | Ref
| Expression |
| 1 | | cleq12 1113 |
. . . . 5
⊢ ((dom F = A ∧ dom
G = B)
→ (dom F = dom G ↔ A =
B)) |
| 2 | | dmeq 2531 |
. . . . 5
⊢ (F =
G → dom F = dom G) |
| 3 | 1, 2 | syl5bi 183 |
. . . 4
⊢ ((dom F = A ∧ dom
G = B)
→ (F = G → A =
B)) |
| 4 | | fndm 2723 |
. . . 4
⊢ (F Fn
A → dom F = A) |
| 5 | | fndm 2723 |
. . . 4
⊢ (G Fn
B → dom G = B) |
| 6 | 3, 4, 5 | syl2an 349 |
. . 3
⊢ ((F Fn
A ∧ G Fn B) →
(F = G
→ A = B)) |
| 7 | | fveq1 2831 |
. . . . . 6
⊢ (F =
G → (F ‘x) =
(G ‘x)) |
| 8 | 7 | a1d 14 |
. . . . 5
⊢ (F =
G → (x ∈ A
→ (F ‘x) = (G
‘x))) |
| 9 | 8 | r19.21aiv 1259 |
. . . 4
⊢ (F =
G → ∀x ∈ A
(F ‘x) = (G
‘x)) |
| 10 | 9 | a1i 7 |
. . 3
⊢ ((F Fn
A ∧ G Fn B) →
(F = G
→ ∀x ∈ A (F
‘x) = (G ‘x))) |
| 11 | 6, 10 | jcad 455 |
. 2
⊢ ((F Fn
A ∧ G Fn B) →
(F = G
→ (A = B ∧ ∀x ∈ A
(F ‘x) = (G
‘x)))) |
| 12 | | visset 1350 |
. . . . . . . . . . . . . . . . 17
⊢ y
∈ V |
| 13 | 12 | fnfvop 2856 |
. . . . . . . . . . . . . . . 16
⊢ ((F Fn
A ∧ x ∈ A)
→ ((F ‘x) = y ↔
〈x, y〉 ∈ F)) |
| 14 | 13 | adantlr 310 |
. . . . . . . . . . . . . . 15
⊢ (((F
Fn A ∧ G Fn A) ∧
x ∈ A) → ((F
‘x) = y ↔ 〈x, y〉
∈ F)) |
| 15 | 12 | fnfvop 2856 |
. . . . . . . . . . . . . . . 16
⊢ ((G Fn
A ∧ x ∈ A)
→ ((G ‘x) = y ↔
〈x, y〉 ∈ G)) |
| 16 | 15 | adantll 309 |
. . . . . . . . . . . . . . 15
⊢ (((F
Fn A ∧ G Fn A) ∧
x ∈ A) → ((G
‘x) = y ↔ 〈x, y〉
∈ G)) |
| 17 | 14, 16 | bibi12d 477 |
. . . . . . . . . . . . . 14
⊢ (((F
Fn A ∧ G Fn A) ∧
x ∈ A) → (((F
‘x) = y ↔ (G
‘x) = y) ↔ (〈x, y〉
∈ F ↔ 〈x, y〉
∈ G))) |
| 18 | | cleq1 1107 |
. . . . . . . . . . . . . 14
⊢ ((F
‘x) = (G ‘x)
→ ((F ‘x) = y ↔
(G ‘x) = y)) |
| 19 | 17, 18 | syl5bi 183 |
. . . . . . . . . . . . 13
⊢ (((F
Fn A ∧ G Fn A) ∧
x ∈ A) → ((F
‘x) = (G ‘x)
→ (〈x, y〉 ∈ F
↔ 〈x, y〉 ∈ G))) |
| 20 | 19 | exp 291 |
. . . . . . . . . . . 12
⊢ ((F Fn
A ∧ G Fn A) →
(x ∈ A → ((F
‘x) = (G ‘x)
→ (〈x, y〉 ∈ F
↔ 〈x, y〉 ∈ G)))) |
| 21 | 20 | a2d 15 |
. . . . . . . . . . 11
⊢ ((F Fn
A ∧ G Fn A) →
((x ∈ A → (F
‘x) = (G ‘x))
→ (x ∈ A → (〈x, y〉
∈ F ↔ 〈x, y〉
∈ G)))) |
| 22 | 21 | com3r 35 |
. . . . . . . . . 10
⊢ (x
∈ A → ((F Fn A ∧
G Fn A)
→ ((x ∈ A → (F
‘x) = (G ‘x))
→ (〈x, y〉 ∈ F
↔ 〈x, y〉 ∈ G)))) |
| 23 | 4 | eleq2d 1156 |
. . . . . . . . . . . . . . . 16
⊢ (F Fn
A → (x ∈ dom F
↔ x ∈ A)) |
| 24 | | visset 1350 |
. . . . . . . . . . . . . . . . 17
⊢ x
∈ V |
| 25 | 24 | opeldm 2534 |
. . . . . . . . . . . . . . . 16
⊢ (〈x, y〉
∈ F → x ∈ dom F) |
| 26 | 23, 25 | syl5bi 183 |
. . . . . . . . . . . . . . 15
⊢ (F Fn
A → (〈x, y〉
∈ F → x ∈ A)) |
| 27 | 26 | con3d 87 |
. . . . . . . . . . . . . 14
⊢ (F Fn
A → (¬ x ∈ A
→ ¬ 〈x, y〉 ∈ F)) |
| 28 | 27 | adantr 306 |
. . . . . . . . . . . . 13
⊢ ((F Fn
A ∧ G Fn A) →
(¬ x ∈ A → ¬ 〈x, y〉
∈ F)) |
| 29 | | fndm 2723 |
. . . . . . . . . . . . . . . . 17
⊢ (G Fn
A → dom G = A) |
| 30 | 29 | eleq2d 1156 |
. . . . . . . . . . . . . . . 16
⊢ (G Fn
A → (x ∈ dom G
↔ x ∈ A)) |
| 31 | 24 | opeldm 2534 |
. . . . . . . . . . . . . . . 16
⊢ (〈x, y〉
∈ G → x ∈ dom G) |
| 32 | 30, 31 | syl5bi 183 |
. . . . . . . . . . . . . . 15
⊢ (G Fn
A → (〈x, y〉
∈ G → x ∈ A)) |
| 33 | 32 | con3d 87 |
. . . . . . . . . . . . . 14
⊢ (G Fn
A → (¬ x ∈ A
→ ¬ 〈x, y〉 ∈ G)) |
| 34 | 33 | adantl 305 |
. . . . . . . . . . . . 13
⊢ ((F Fn
A ∧ G Fn A) →
(¬ x ∈ A → ¬ 〈x, y〉
∈ G)) |
| 35 | 28, 34 | jcad 455 |
. . . . . . . . . . . 12
⊢ ((F Fn
A ∧ G Fn A) →
(¬ x ∈ A → (¬ 〈x, y〉
∈ F ∧ ¬ 〈x, y〉
∈ G))) |
| 36 | | pm5.21 502 |
. . . . . . . . . . . . 13
⊢ ((¬ 〈x, y〉
∈ F ∧ ¬ 〈x, y〉
∈ G) → (〈x, y〉
∈ F ↔ 〈x, y〉
∈ G)) |
| 37 | 36 | a1d 14 |
. . . . . . . . . . . 12
⊢ ((¬ 〈x, y〉
∈ F ∧ ¬ 〈x, y〉
∈ G) → ((x ∈ A
→ (F ‘x) = (G
‘x)) → (〈x, y〉
∈ F ↔ 〈x, y〉
∈ G))) |
| 38 | 35, 37 | syl6 23 |
. . . . . . . . . . 11
⊢ ((F Fn
A ∧ G Fn A) →
(¬ x ∈ A → ((x
∈ A → (F ‘x) =
(G ‘x)) → (〈x, y〉
∈ F ↔ 〈x, y〉
∈ G)))) |
| 39 | 38 | com12 13 |
. . . . . . . . . 10
⊢ (¬ x ∈ A
→ ((F Fn A ∧ G Fn
A) → ((x ∈ A
→ (F ‘x) = (G
‘x)) → (〈x, y〉
∈ F ↔ 〈x, y〉
∈ G)))) |
| 40 | 22, 39 | pm2.61i 110 |
. . . . . . . . 9
⊢ ((F Fn
A ∧ G Fn A) →
((x ∈ A → (F
‘x) = (G ‘x))
→ (〈x, y〉 ∈ F
↔ 〈x, y〉 ∈ G))) |
| 41 | 40 | 19.21adv 945 |
. . . . . . . 8
⊢ ((F Fn
A ∧ G Fn A) →
((x ∈ A → (F
‘x) = (G ‘x))
→ ∀y(〈x, y〉
∈ F ↔ 〈x, y〉
∈ G))) |
| 42 | 41 | 19.20dv 946 |
. . . . . . 7
⊢ ((F Fn
A ∧ G Fn A) →
(∀x(x ∈ A
→ (F ‘x) = (G
‘x)) → ∀x∀y(〈x,
y〉 ∈ F ↔ 〈x, y〉
∈ G))) |
| 43 | | df-ral 1205 |
. . . . . . 7
⊢ (∀x ∈ A
(F ‘x) = (G
‘x) ↔ ∀x(x ∈
A → (F ‘x) =
(G ‘x))) |
| 44 | 42, 43 | syl5ib 181 |
. . . . . 6
⊢ ((F Fn
A ∧ G Fn A) →
(∀x ∈ A (F
‘x) = (G ‘x)
→ ∀x∀y(〈x,
y〉 ∈ F ↔ 〈x, y〉
∈ G))) |
| 45 | | cleqrel 2483 |
. . . . . . 7
⊢ ((Rel F ∧ Rel G)
→ (F = G ↔ ∀x∀y(〈x,
y〉 ∈ F ↔ 〈x, y〉
∈ G))) |
| 46 | | fnrel 2722 |
. . . . . . 7
⊢ (F Fn
A → Rel F) |
| 47 | | fnrel 2722 |
. . . . . . 7
⊢ (G Fn
A → Rel G) |
| 48 | 45, 46, 47 | syl2an 349 |
. . . . . 6
⊢ ((F Fn
A ∧ G Fn A) →
(F = G
↔ ∀x∀y(〈x,
y〉 ∈ F ↔ 〈x, y〉
∈ G))) |
| 49 | 44, 48 | sylibrd 179 |
. . . . 5
⊢ ((F Fn
A ∧ G Fn A) →
(∀x ∈ A (F
‘x) = (G ‘x)
→ F = G)) |
| 50 | | fneq2 2719 |
. . . . . 6
⊢ (A =
B → (G Fn A ↔
G Fn B)) |
| 51 | 50 | biimparc 327 |
. . . . 5
⊢ ((G Fn
B ∧ A = B) →
G Fn A) |
| 52 | 49, 51 | sylan2 346 |
. . . 4
⊢ ((F Fn
A ∧ (G Fn B ∧
A = B))
→ (∀x ∈ A (F
‘x) = (G ‘x)
→ F = G)) |
| 53 | 52 | exp32 294 |
. . 3
⊢ (F Fn
A → (G Fn B →
(A = B
→ (∀x ∈ A (F
‘x) = (G ‘x)
→ F = G)))) |
| 54 | 53 | imp4b 283 |
. 2
⊢ ((F Fn
A ∧ G Fn B) →
((A = B
∧ ∀x ∈ A (F
‘x) = (G ‘x))
→ F = G)) |
| 55 | 11, 54 | impbid 397 |
1
⊢ ((F Fn
A ∧ G Fn B) →
(F = G
↔ (A = B ∧ ∀x ∈ A
(F ‘x) = (G
‘x)))) |