Theorem isoti 7347

Description: An isomorphism preserves tightness. (Contributed by Jim Kingdon, 26-Nov-2021.)

Assertion

Ref	Expression
isoti	⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) ↔ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢))))

Distinct variable groups:   𝑢,𝐴,𝑣   𝑢,𝐵,𝑣   𝑢,𝐹,𝑣   𝑢,𝑅,𝑣   𝑢,𝑆,𝑣

Proof of Theorem isoti

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isocnv 6017	. . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴))
2		isotilem 7346	. . . 4 ⊢ (◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥))))
3	1, 2	syl 14	. . 3 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥))))
4		isotilem 7346	. . 3 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥)) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢))))
5	3, 4	impbid 129	. 2 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥))))
6		equequ1 1764	. . . 4 ⊢ (𝑥 = 𝑢 → (𝑥 = 𝑦 ↔ 𝑢 = 𝑦))
7		breq1 4133	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑥𝑆𝑦 ↔ 𝑢𝑆𝑦))
8	7	notbid 677	. . . . 5 ⊢ (𝑥 = 𝑢 → (¬ 𝑥𝑆𝑦 ↔ ¬ 𝑢𝑆𝑦))
9		breq2 4134	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑦𝑆𝑥 ↔ 𝑦𝑆𝑢))
10	9	notbid 677	. . . . 5 ⊢ (𝑥 = 𝑢 → (¬ 𝑦𝑆𝑥 ↔ ¬ 𝑦𝑆𝑢))
11	8, 10	anbi12d 477	. . . 4 ⊢ (𝑥 = 𝑢 → ((¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥) ↔ (¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢)))
12	6, 11	bibi12d 235	. . 3 ⊢ (𝑥 = 𝑢 → ((𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥)) ↔ (𝑢 = 𝑦 ↔ (¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢))))
13		equequ2 1765	. . . 4 ⊢ (𝑦 = 𝑣 → (𝑢 = 𝑦 ↔ 𝑢 = 𝑣))
14		breq2 4134	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑢𝑆𝑦 ↔ 𝑢𝑆𝑣))
15	14	notbid 677	. . . . 5 ⊢ (𝑦 = 𝑣 → (¬ 𝑢𝑆𝑦 ↔ ¬ 𝑢𝑆𝑣))
16		breq1 4133	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑦𝑆𝑢 ↔ 𝑣𝑆𝑢))
17	16	notbid 677	. . . . 5 ⊢ (𝑦 = 𝑣 → (¬ 𝑦𝑆𝑢 ↔ ¬ 𝑣𝑆𝑢))
18	15, 17	anbi12d 477	. . . 4 ⊢ (𝑦 = 𝑣 → ((¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢) ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢)))
19	13, 18	bibi12d 235	. . 3 ⊢ (𝑦 = 𝑣 → ((𝑢 = 𝑦 ↔ (¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢)) ↔ (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢))))
20	12, 19	cbvral2v 2799	. 2 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥)) ↔ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢)))
21	5, 20	bitrdi 196	1 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) ↔ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  ∀wral 2528   class class class wbr 4130  ^◡ccnv 4773   Isom wiso 5378

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386

This theorem is used by:  supisoti  7350